Scheduling of Serial Multiproduct Batch Processes via Simulated Annealing
نویسندگان
چکیده
We present an in-depth study of the simulated annealing approach to the scheduling of serial multiproduct batch processes under the assumption of a permutation schedule. Four versions of the simulated annealing algorithm are studied based on two move acceptance criteria, the Metropolis algorithm and the Glauber algorithm, and two annealing schedules, the exponential schedule and the Aarts and van Laarhoven schedule. Makespan minimization is performed for unlimited intermediate storage (UIS), no intermediate storage (NIS), zero wait (ZW), finite intermediate storage (FIS) and mixed intermediate storage (MIS) flowshop problems using simulated annealing and also the idle matrix search (IMS) heuristic. Of the four versions of the simulated annealing algorithm studied. the Metrooolis algorithm with the Aarts and van Laarhoven annealing schedule ii fo&td to give the best results, ‘with all four versions giving significantly better results than the IMS heuristic. The Metropolis algorithm with the Aarts and van Laarhoven annealing schedule is studied in more detail for further comparison with the IMS heuristic in terms of the comoutational effort expended by the simulated annealing algorithm . and the solution quality obtained.
منابع مشابه
Appling Metaheuristic Algorithms on a Two Stage Hybrid Flowshop Scheduling Problem with Serial Batching (RESEARCH NOTE)
In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is investigated. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among th...
متن کاملOptimization of A Fed-Batch Fermenter Producing Bakerâs Yeast Using Simulated Annealing Method
Modeling of fermentation processes is so complicated and uncertain; therefore it is necessary to provide a robust and appropriate dynamic optimization method. In order to obtain the maximum amount of yeast (Saccharomyces cerevisiae), the bioreactor must be operated under optimal conditions. To determine substrate feeding in a fed-batch bioreactor, a simulated annealing (SA) approach was examine...
متن کاملTimed Petri-Net Representation for Short Term Scheduling of Multiproduct Batch Plants
Scheduling is one of the interesting research fields in batch chemical industries, which substantially differs from that in discrete manufacturing systems. One of the main differences between these two fields is the intermediate storage of materials, which appears in chemical processes. This situation prevents the direct applicability of some of the scheduling techniques (such as Petri nets) us...
متن کاملAppropriate Evolutionary Algorithm for Scheduling in FMS
The diffusion of flexible manufacturing systems (FMS) has not only invigorated production systems, but has also given considerable impetus to relevant analytical fields like scheduling theory and adaptive controls. Depending on the demand of the job there can be variation in batch size. The change in the jobs depends upon the renewal rate. But this does not involve much change in the FMS setup....
متن کاملScheduling Problem of Virtual Cellular Manufacturing Systems (VCMS); Using Simulated Annealing and Genetic Algorithm based Heuristics
In this paper, we present a simulated annealing (SA) and a genetic algorithm (GA) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. A virtual manufacturing cell (VMC) is a group of resources that is dedicated to the manufacturing of a part family. Although this grouping is not reflected in the physical structure of the manufacturing system, but machin...
متن کامل